SOLVING BLASIUS EQUATION USING IMPERIALIST COMPETITIVE ALGORITHM
author
Abstract:
In this study, a new approach isintroduced to solve Blasius differential equation using of ImperialistCompetitive Algorithm (ICA). This algorithm is inspired by competitionmechanism among Imperialists and colonies and has demonstrated excellent capabilitiessuch as simplicity, accuracy, faster convergence and better global optimumachievement in contrast to other evolutionary algorithms. The obtained results havebeen compared with the exact solution of Blasius equation and another resultobtained in previous works and showhigher accuracy and less computational requirements. Inaddition, the method presented with details can beeasily extended to solve a wide range of nonlinear problems.
similar resources
Solving the Constrained Nonlinear Optimization based on Imperialist Competitive Algorithm
In this work a strong framework is presented for solving the constrained nonlinear optimization problem that is a relatively complicated problem. These problems arise in a diverse range of sciences. There are a number of different approaches have been proposed. In this work, we employ the imperialist competitive algorithm (ICA) for solving constrained nonlinear optimization problems. Some well-...
full textUsing Imperialist competitive algorithm optimization in multi-response nonlinear programming
The quality of manufactured products is characterized by many controllable quality factors. These factors should be optimized to reach high quality products. In this paper we try to find the controllable factors levels with minimum deviation from the target and with a least variation. To solve the problem a simple aggregation function is used to aggregate the multiple responses functions then a...
full textOptimization of Fabric Layout by Using Imperialist Competitive Algorithm
In textile industry, marker planning is one of the main operations in the cutting fabric stage. Marker packing is usually used to maximize cloth exploitation and minimize its waste. In this research, a method is used based on new found meta-heuristic imperialist competitive algorithm (ICA) and Bottom-Left-Fill Algorithm (BLF) to achieve optimal marker packing. Function of the proposed method wa...
full textOPTIMIZATION TO IDENTIFY MUSKINGUM MODEL PARAMETERS USING IMPERIALIST COMPETITIVE ALGORITHM
In engineering, flood routing is an important technique necessary for the solution of a floodcontrol problem and for the satisfactory operation of a flood-prediction service. A simple conceptual model like the Muskingum model is very effective for the flood routing process. One challenge in application of the Muskingum model is that its parameters cannot be measured physically. In this article ...
full textOptimizing locomotive body structures using imperialist competitive algorithm
In today's design, system complexity and increasing demand for safer, more efficient and less costly systems have created new challenges in science and engineering. Locomotives are products which are designed according to market order and technical needs of customers. Accordingly, targets of companies, especially designers and manufacturers of locomotives, have always been on the path of progre...
full textSolving the n-queens problem using a tuned hybrid imperialist competitive algorithm
The n-queens problem is a classical combinatorial optimization problem which has been proved to be NP-hard. The goal is to place n non-attacking queens on an n×n chessboard. In this paper, the Imperialist Competitive Algorithm (ICA), which is a recent evolutionary metaheuristic method, has been applied for solving the n-queens problem. As another variation, the ICA was combined with a local sea...
full textMy Resources
Journal title
volume 4 issue 2 (SPRING)
pages 103- 114
publication date 2014-03-21
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023